Algorithms for calculation damage processes
نویسندگان
چکیده
منابع مشابه
Algorithms for Infeasible Path Calculation
Static Worst-Case Execution Time (WCET) analysis is a technique to derive upper bounds for the execution times of programs. Such bounds are crucial when designing and verifying real-time systems. A key component in static WCET analysis is to derive flow information, such as loop bounds and infeasible paths. Such flow information can be provided as either as annotations by the user, can be autom...
متن کاملAn algebraic calculation method for describing time-dependent processes in electrochemistry – Expansion of existing procedures
In this paper an alternative model allowing the extension of the Debye-Hückel Theory (DHT) considering time dependence explicitly is presented. From the Electro-Quasistatic approach (EQS) introduced in earlier studies time dependent potentials are suitable to describe several phenomena especially conducting media as well as the behaviour of charged particles (ions) in electrolytes. This leads t...
متن کاملCamparison of Numerically Stability of Two Algorithms for the Calculation of Variance
In descriptive statistics, there are two computational algorithms for determining the variance S2, of a set of observations : Algorithm 1: S2= - , Algorithm 2: S2= , where . It is interesting to discuss, which of the above formulas is numerically more trustworthy in machine numbers sets. I this paper, based on total effect of rounding error, we prove that the second Algorithm is better...
متن کاملIncremental Calculation for Fully Adaptive Algorithms
The step complexity of fully adaptive (FA) algorithms depends only on the contention during an operation, when counting both local computation and accesses to shared registers. This paper contributes to the design of efficient fully adaptive algorithms by specifying and implementing two generic objects, Gather&f and Collect&f . A Gather&f object returns the value of applying a function f on the...
متن کاملBlock Algorithms for Quark Propagator Calculation
Computing quark propagators in lattice QCD is equivalent to solving large, sparse linear systems with multiple right-hand sides. Block algorithms attempt to accelerate the convergence of iterative Krylov-subspace methods by solving the multiple systems simultaneously. This paper compares a block generalisation of the quasi-minimal residual method (QMR), Block Conjugate Gradient on the normal eq...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Frattura ed Integrità Strutturale
سال: 2019
ISSN: 1971-8993
DOI: 10.3221/igf-esis.49.22